Cyclic Sieving for cyclic codes
نویسندگان
چکیده
Prompted by a question of Jim Propp, this paper examines the cyclic sieving phenomenon (CSP) in certain codes. For example, it is shown that, among dual Hamming codes over Fq, generating function for codedwords according to major index statistic (resp. inversion statistic) gives rise CSP when q=2 or q=3 q=2). A byproduct curious characterization irreducible polynomials F2[x] and F3[x] that are primitive.
منابع مشابه
Cyclic Sieving for Cyclic Codes
These are notes on a preliminary follow-up to a question of Jim Propp, about cyclic sieving of cyclic codes. We show that two of the Mahonian polynomials are cyclic sieving polynomials for certain Dual Hamming Codes: X and X inv for q = 2, 3 and q = 2, respectively.
متن کاملThe cyclic sieving phenomenon
The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge’s q 1⁄4 1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues. r 2004 Elsevier Inc. A...
متن کاملCyclic Sieving of Matchings
Let Pn denote the poset of matchings on 2n points on a circle, labeled 1, 2, . . . , 2n in cyclic order, in which we define an element to be less than another element if it can be obtained by an uncrossing. Let Pn,k denote the level of the poset with k crossings. Let Pn,k denote the level of the poset with k crossings. We study the cyclic sieving phenomenon of Pn,k. It is known that the triple ...
متن کاملThe Cyclic Sieving Phenomenon for Faces of Cyclic Polytopes
A cyclic polytope of dimension d with n vertices is a convex polytope combinatorially equivalent to the convex hull of n distinct points on a moment curve in R. In this paper, we prove the cyclic sieving phenomenon, introduced by Reiner-StantonWhite, for faces of an even-dimensional cyclic polytope, under a group action that cyclically translates the vertices. For odd-dimensional cyclic polytop...
متن کاملCyclic Sieving and Cluster Multicomplexes
Reiner, Stanton, and White [10] proved results regarding the enumeration of polygon dissections up to rotational symmetry. Eu and Fu [2] generalized these results to Cartan-Killing types other than A by means of actions of deformed Coxeter elements on cluster complexes of Fomin and Zelevinsky [6]. The ReinerStanton-White and Eu-Fu results were proven using direct counting arguments. We give rep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2021
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2021.101846